Counting subwords in flattened permutations
نویسندگان
چکیده
منابع مشابه
Counting subwords in flattened permutations
In this paper, we consider the number of occurrences of descents, ascents, 123-subwords, 321-subwords, peaks and valleys in flattened permutations, which were recently introduced by Callan in his study of finite set partitions. For descents and ascents, we make use of the kernel method and obtain an explicit formula (in terms of Eulerian polynomials) for the distribution on Sn in the flattened ...
متن کاملCounting subwords in flattened partitions of sets
In this paper, we consider the problem of avoidance of subword patterns in flattened partitions, which extends recent work of Callan. We determine in all cases explicit formulas and/or generating functions for the number of set partitions of size n which avoid a single subword pattern of length three. The asymptotic behavior of the resulting counting sequences turns out to depend quite heavily ...
متن کاملCounting `-letter subwords in compositions
Let N be the set of all positive integers and let A be any ordered subset of N. Recently, Heubach and Mansour enumerated the number of compositions of nwithm parts inA that contain the subword τ exactly r times, where τ ∈ {111, 112, 221, 123}. Our aims are (1) to generalize the above results, i.e., to enumerate the number of compositions of n with m parts in A that contain an `-letter subword, ...
متن کاملCounting l-letter subwords in compositions
Let N be the set of all positive integers and let A be any ordered subset of N. Recently, Heubach and Mansour enumerated the number of compositions of n with m parts in A that contain the subword τ exactly r times, where τ ∈ {111, 112, 221, 123}. Out aims are (1) to generalize the above results, i.e., to enumerate the number of compositions of n with m parts in A that contain an l-letter subwor...
متن کاملCounting Subwords Occurrences in Base-b Expansions
We count the number of distinct (scattered) subwords occurring in the base-b expansion of the nonnegative integers. More precisely, we consider the sequence (Sb(n))n≥0 counting the number of positive entries on each row of a generalization of the Pascal triangle to binomial coefficients of base-b expansions. By using a convenient tree structure, we provide recurrence relations for (Sb(n))n≥0 le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2013
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2013.v4.n3.a4